Approximate convolution using DCT coefficient multipliers
نویسندگان
چکیده
DCT-domain processing, filtering, convolution, image enhancement, quantization tables We develop a method for designing DCT coefficient multipliers in order to approximate the operation of 2D convolution of an image with a given kernel. The method is easy to implement on compressed formats of DCT-based compression methods (JPEG, MPEG, H.261) by applying decoding quantization tables that are inconsistent with the encoding quantization tables.
منابع مشابه
L/M-fold image resizing in block-DCT domain using symmetric convolution
Image resizing is to change an image size by upsampling or downsampling of a digital image. Most still images and video frames on digital media are given in a compressed domain. Image resizing of a compressed image can be performed in the spatial domain via decompression and recompression. In general, resizing of a compressed image in a compressed domain is much faster than that in the spatial ...
متن کاملImplementation of fixed DSP functions using the reduced coefficient multiplier
Distributed Arithmetic (DA) has been successfully applied to the design of area efficient multipliers on FPGAs for DSP applications. Whilst DA is efficient in applications where coefficients are fixed, there is little option for applications with a limited range of coefficient values. This paper describes a technique for developing areaefficient multipliers for a range of DSP applications that ...
متن کاملThe Efficient Memory - Based VLSI Array Designs For DFT and DCT
In this paper, the efficient memory-based VLSI arrays and the accompanied new design approach for the discrete Fourier transform (DFT) and discrete cosine transform (DCT) are presented. The DFT and DCT are formulated as cyclic convolution forms and mapped into linear arrays which characterize small numbers of 1 / 0 channels and low 1 / 0 bandwidth. Since the multipliers consume much hardware ar...
متن کاملOptimum word length allocation for multipliers of integer DCT
Recently, the integer DCT (Int-DCT), which has the rounding operations in the lifting structure, is attracting many researchers' attention as an effective method for DCT based lossy / lossless unified coding. So far, focuses of the previous reports relevant to the Int-DCT have been limited to a few topics such as how to reduce the number of multipliers with the four point lossless Hadamard tran...
متن کاملAn Efficient VLSI Linear Array for DCT/IDCT Using Subband Decomposition Algorithm
Discrete Cosine transform DCT and inverse DCT IDCT have been widely used in many image processing systems and real-time computation of nonlinear time series. In this paper, a novel lineararray of DCT and IDCT is derived from the data flow of subband decompositions representing the factorized coefficient matrices in the matrix formulation of the recursive algorithm. For increasing the throughput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Circuits Syst. Video Techn.
دوره 8 شماره
صفحات -
تاریخ انتشار 1998